Quad-kd trees: A general framework for kd trees and quad trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kinetic kd-Trees

We propose a simple variant of kd-trees, called rankbased kd-trees, for sets of points in R. We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search queries in O(n1−1/d + k) time, where k is the output size. The main advantage of rank-based kd-trees is that they can be efficiently kinetized: the KDS processes O(n) events in the worst case, assuming that the points fol...

متن کامل

Kinetic Medians and kd-Trees

We propose algorithms for maintaining two variants of kd-trees of a set of moving points in the plane. A pseudo kd-tree allows the number of points stored in the two children to differ. An overlapping kd-tree allows the bounding boxes of two children to overlap. We show that both of them support range search operations in O(n) time, where 2 only depends on the approximation precision. When the ...

متن کامل

Ising models and multiresolution quad - trees by

We study percolation and Ising models defined on generalizations of quad-trees used in multiresolution image analysis. These can be viewed as trees for which each mother vertex has 2 daughter vertices, and for which daughter vertices are linked together in d-dimensional Euclidean configurations. Retention probabilities / interaction strengths differ according to whether the relevant bond is bet...

متن کامل

Texture Minification using Quad-trees and Fipmaps

The paper extends the recently published methods for image reconstruction and texture minification using the generalized ripmap method, named fipmap, and quad-trees. Fipmap is based on the technique of partitioned iterated function systems, used in fractal image compression. The quad-tree texture reconstruction algorithm works well for many standard cases. The special cases can be solved using ...

متن کامل

Maxdiff kd-trees for data condensation

Prototype selection on the basis of conventional clustering algorithms results in good representation but is extremely time-taking on large data sets. kd-trees, on the other hand, are exceptionally efficient in terms of time and space requirements for large data sets, but fail to produce a reasonable representation in certain situations. We propose a new algorithm with speed comparable to the p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2016

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2015.12.030